Limited Packing and Multiple Domination problems: Polynomial time reductions
نویسندگان
چکیده
منابع مشابه
Polynomial-time kernel reductions
Today, the computational complexity of equivalence problems such as the graph isomorphism problem and the Boolean formula equivalence problem remain only partially understood. One of the most important tools for determining the (relative) difficulty of a computational problem is the many-one reduction, which provides a way to encode an instance of one problem into an instance of another. In equ...
متن کاملPolynomial Time Approximation Schemes for Class-Constrained Packing Problems
We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di<erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can accommodate. In the class-constrained multiple knapsack (CCMK) problem, our goal is to maximize ...
متن کاملComplexity Classes and Polynomial - time Reductions
The first hard problem we will examine is what is known as Satisfiability or SAT. As input, we are given a set of n boolean variables X = {x1, x2, . . . , xn} (i.e., each variable can be set to either true or false). We are then given a boolean formula over these variables of the following form (noting that this is just a specific example where X = {x1, x2, x3, x4}): (x1 ∨ x2 ∨ x3) ∧ (x2 ∨ x3 ∨...
متن کاملOptimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination powers. Broadcast domination assigns an integer power f(v) ≥ 0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v having f(v) ≥ 1. The optimal broadcast d...
متن کاملDomination, Packing and Excluded Minors
Let γ(G) be the domination number of a graph G, and let αk(G) be the maximum number of vertices in G, no two of which are at distance ≤ k in G. It is easy to see that γ(G) ≥ α2(G). In this note it is proved that γ(G) is bounded from above by a linear function in α2(G) if G has no large complete bipartite graph minors. Extensions to other parameters αk(G) are also derived.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.023